Left Termination of the query pattern
perm(g,a)
w.r.t. the given Prolog program could successfully be proven:

0 Prolog
↳1 PrologToDTProblemTransformerProof (⇒, 83 ms)
↳2 TRIPLES
↳3 TriplesToPiDPProof (⇒, 105 ms)
↳4 PiDP
↳5 DependencyGraphProof (⇔, 0 ms)
↳6 AND
    ↳7 PiDP
        ↳8 UsableRulesProof (⇔, 0 ms)
        ↳9 PiDP
        ↳10 PiDPToQDPProof (⇒, 0 ms)
        ↳11 QDP
        ↳12 QDPSizeChangeProof (⇔, 0 ms)
        ↳13 YES
    ↳14 PiDP
        ↳15 UsableRulesProof (⇔, 0 ms)
        ↳16 PiDP
        ↳17 PiDPToQDPProof (⇒, 0 ms)
        ↳18 QDP
        ↳19 QDPSizeChangeProof (⇔, 0 ms)
        ↳20 YES
    ↳21 PiDP
        ↳22 PiDPToQDPProof (⇒, 0 ms)
        ↳23 QDP
        ↳24 Rewriting (⇔, 0 ms)
        ↳25 QDP
        ↳26 UsableRulesProof (⇔, 0 ms)
        ↳27 QDP
        ↳28 QReductionProof (⇔, 0 ms)
        ↳29 QDP
        ↳30 Rewriting (⇔, 0 ms)
        ↳31 QDP
        ↳32 UsableRulesProof (⇔, 0 ms)
        ↳33 QDP
        ↳34 QReductionProof (⇔, 0 ms)
        ↳35 QDP
        ↳36 Instantiation (⇔, 0 ms)
        ↳37 QDP
        ↳38 QDPOrderProof (⇔, 93 ms)
        ↳39 QDP
        ↳40 DependencyGraphProof (⇔, 0 ms)
        ↳41 TRUE

(0) Obligation:

Clauses:

append2(parts([], Y), is(sum(Y))).
append2(parts(.(H, X), Y), is(sum(.(H, Z)))) :- append2(parts(X, Y), is(sum(Z))).
append1(parts([], Y), is(sum(Y))).
append1(parts(.(H, X), Y), is(sum(.(H, Z)))) :- append1(parts(X, Y), is(sum(Z))).
perm([], []).
perm(L, .(H, T)) :- ','(append2(parts(V, .(H, U)), is(sum(L))), ','(append1(parts(V, U), is(sum(W))), perm(W, T))).

Query: perm(g,a)

(1) PrologToDTProblemTransformerProof (SOUND transformation)

Built DT problem from termination graph DT10.

(2) Obligation:

Triples:

append2C(.(X1, X2), X3, X4, .(X1, X5)) :- append2C(X2, X3, X4, X5).
append1E(.(X1, X2), X3, .(X1, X4)) :- append1E(X2, X3, X4).
permA(.(X1, X2), .(X1, X3)) :- ','(append1cB(X2, X4), permA(X4, X3)).
permA(.(X1, X2), .(X3, X4)) :- append2C(X5, X3, X6, X2).
permA(.(X1, X2), .(X3, X4)) :- ','(append2cC(X5, X3, X6, X2), append1E(X5, X6, X7)).
permA(.(X1, X2), .(X3, X4)) :- ','(append2cC(X5, X3, X6, X2), ','(append1cD(X1, X5, X6, X7), permA(X7, X4))).

Clauses:

permcA([], []).
permcA(.(X1, X2), .(X1, X3)) :- ','(append1cB(X2, X4), permcA(X4, X3)).
permcA(.(X1, X2), .(X3, X4)) :- ','(append2cC(X5, X3, X6, X2), ','(append1cD(X1, X5, X6, X7), permcA(X7, X4))).
append2cC([], X1, X2, .(X1, X2)).
append2cC(.(X1, X2), X3, X4, .(X1, X5)) :- append2cC(X2, X3, X4, X5).
append1cE([], X1, X1).
append1cE(.(X1, X2), X3, .(X1, X4)) :- append1cE(X2, X3, X4).
append1cB(X1, X1).
append1cD(X1, X2, X3, .(X1, X4)) :- append1cE(X2, X3, X4).

Afs:

permA(x1, x2)  =  permA(x1)

(3) TriplesToPiDPProof (SOUND transformation)

We use the technique of [DT09]. With regard to the inferred argument filtering the predicates were used in the following modes:
permA_in: (b,f)
append2C_in: (f,f,f,b)
append2cC_in: (f,f,f,b)
append1E_in: (b,b,f)
append1cD_in: (b,b,b,f)
append1cE_in: (b,b,f)
Transforming TRIPLES into the following Term Rewriting System:
Pi DP problem:
The TRS P consists of the following rules:

PERMA_IN_GA(.(X1, X2), .(X1, X3)) → U3_GA(X1, X2, X3, append1cB_in_ga(X2, X4))
U3_GA(X1, X2, X3, append1cB_out_ga(X2, X4)) → U4_GA(X1, X2, X3, permA_in_ga(X4, X3))
U3_GA(X1, X2, X3, append1cB_out_ga(X2, X4)) → PERMA_IN_GA(X4, X3)
PERMA_IN_GA(.(X1, X2), .(X3, X4)) → U5_GA(X1, X2, X3, X4, append2C_in_aaag(X5, X3, X6, X2))
PERMA_IN_GA(.(X1, X2), .(X3, X4)) → APPEND2C_IN_AAAG(X5, X3, X6, X2)
APPEND2C_IN_AAAG(.(X1, X2), X3, X4, .(X1, X5)) → U1_AAAG(X1, X2, X3, X4, X5, append2C_in_aaag(X2, X3, X4, X5))
APPEND2C_IN_AAAG(.(X1, X2), X3, X4, .(X1, X5)) → APPEND2C_IN_AAAG(X2, X3, X4, X5)
PERMA_IN_GA(.(X1, X2), .(X3, X4)) → U6_GA(X1, X2, X3, X4, append2cC_in_aaag(X5, X3, X6, X2))
U6_GA(X1, X2, X3, X4, append2cC_out_aaag(X5, X3, X6, X2)) → U7_GA(X1, X2, X3, X4, append1E_in_gga(X5, X6, X7))
U6_GA(X1, X2, X3, X4, append2cC_out_aaag(X5, X3, X6, X2)) → APPEND1E_IN_GGA(X5, X6, X7)
APPEND1E_IN_GGA(.(X1, X2), X3, .(X1, X4)) → U2_GGA(X1, X2, X3, X4, append1E_in_gga(X2, X3, X4))
APPEND1E_IN_GGA(.(X1, X2), X3, .(X1, X4)) → APPEND1E_IN_GGA(X2, X3, X4)
U6_GA(X1, X2, X3, X4, append2cC_out_aaag(X5, X3, X6, X2)) → U8_GA(X1, X2, X3, X4, append1cD_in_ggga(X1, X5, X6, X7))
U8_GA(X1, X2, X3, X4, append1cD_out_ggga(X1, X5, X6, X7)) → U9_GA(X1, X2, X3, X4, permA_in_ga(X7, X4))
U8_GA(X1, X2, X3, X4, append1cD_out_ggga(X1, X5, X6, X7)) → PERMA_IN_GA(X7, X4)

The TRS R consists of the following rules:

append1cB_in_ga(X1, X1) → append1cB_out_ga(X1, X1)
append2cC_in_aaag([], X1, X2, .(X1, X2)) → append2cC_out_aaag([], X1, X2, .(X1, X2))
append2cC_in_aaag(.(X1, X2), X3, X4, .(X1, X5)) → U16_aaag(X1, X2, X3, X4, X5, append2cC_in_aaag(X2, X3, X4, X5))
U16_aaag(X1, X2, X3, X4, X5, append2cC_out_aaag(X2, X3, X4, X5)) → append2cC_out_aaag(.(X1, X2), X3, X4, .(X1, X5))
append1cD_in_ggga(X1, X2, X3, .(X1, X4)) → U18_ggga(X1, X2, X3, X4, append1cE_in_gga(X2, X3, X4))
append1cE_in_gga([], X1, X1) → append1cE_out_gga([], X1, X1)
append1cE_in_gga(.(X1, X2), X3, .(X1, X4)) → U17_gga(X1, X2, X3, X4, append1cE_in_gga(X2, X3, X4))
U17_gga(X1, X2, X3, X4, append1cE_out_gga(X2, X3, X4)) → append1cE_out_gga(.(X1, X2), X3, .(X1, X4))
U18_ggga(X1, X2, X3, X4, append1cE_out_gga(X2, X3, X4)) → append1cD_out_ggga(X1, X2, X3, .(X1, X4))

The argument filtering Pi contains the following mapping:
permA_in_ga(x1, x2)  =  permA_in_ga(x1)
.(x1, x2)  =  .(x1, x2)
append1cB_in_ga(x1, x2)  =  append1cB_in_ga(x1)
append1cB_out_ga(x1, x2)  =  append1cB_out_ga(x1, x2)
append2C_in_aaag(x1, x2, x3, x4)  =  append2C_in_aaag(x4)
append2cC_in_aaag(x1, x2, x3, x4)  =  append2cC_in_aaag(x4)
append2cC_out_aaag(x1, x2, x3, x4)  =  append2cC_out_aaag(x1, x2, x3, x4)
U16_aaag(x1, x2, x3, x4, x5, x6)  =  U16_aaag(x1, x5, x6)
append1E_in_gga(x1, x2, x3)  =  append1E_in_gga(x1, x2)
append1cD_in_ggga(x1, x2, x3, x4)  =  append1cD_in_ggga(x1, x2, x3)
U18_ggga(x1, x2, x3, x4, x5)  =  U18_ggga(x1, x2, x3, x5)
append1cE_in_gga(x1, x2, x3)  =  append1cE_in_gga(x1, x2)
[]  =  []
append1cE_out_gga(x1, x2, x3)  =  append1cE_out_gga(x1, x2, x3)
U17_gga(x1, x2, x3, x4, x5)  =  U17_gga(x1, x2, x3, x5)
append1cD_out_ggga(x1, x2, x3, x4)  =  append1cD_out_ggga(x1, x2, x3, x4)
PERMA_IN_GA(x1, x2)  =  PERMA_IN_GA(x1)
U3_GA(x1, x2, x3, x4)  =  U3_GA(x1, x2, x4)
U4_GA(x1, x2, x3, x4)  =  U4_GA(x1, x2, x4)
U5_GA(x1, x2, x3, x4, x5)  =  U5_GA(x1, x2, x5)
APPEND2C_IN_AAAG(x1, x2, x3, x4)  =  APPEND2C_IN_AAAG(x4)
U1_AAAG(x1, x2, x3, x4, x5, x6)  =  U1_AAAG(x1, x5, x6)
U6_GA(x1, x2, x3, x4, x5)  =  U6_GA(x1, x2, x5)
U7_GA(x1, x2, x3, x4, x5)  =  U7_GA(x1, x2, x5)
APPEND1E_IN_GGA(x1, x2, x3)  =  APPEND1E_IN_GGA(x1, x2)
U2_GGA(x1, x2, x3, x4, x5)  =  U2_GGA(x1, x2, x3, x5)
U8_GA(x1, x2, x3, x4, x5)  =  U8_GA(x1, x2, x5)
U9_GA(x1, x2, x3, x4, x5)  =  U9_GA(x1, x2, x5)

We have to consider all (P,R,Pi)-chains

Infinitary Constructor Rewriting Termination of PiDP implies Termination of TRIPLES

(4) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

PERMA_IN_GA(.(X1, X2), .(X1, X3)) → U3_GA(X1, X2, X3, append1cB_in_ga(X2, X4))
U3_GA(X1, X2, X3, append1cB_out_ga(X2, X4)) → U4_GA(X1, X2, X3, permA_in_ga(X4, X3))
U3_GA(X1, X2, X3, append1cB_out_ga(X2, X4)) → PERMA_IN_GA(X4, X3)
PERMA_IN_GA(.(X1, X2), .(X3, X4)) → U5_GA(X1, X2, X3, X4, append2C_in_aaag(X5, X3, X6, X2))
PERMA_IN_GA(.(X1, X2), .(X3, X4)) → APPEND2C_IN_AAAG(X5, X3, X6, X2)
APPEND2C_IN_AAAG(.(X1, X2), X3, X4, .(X1, X5)) → U1_AAAG(X1, X2, X3, X4, X5, append2C_in_aaag(X2, X3, X4, X5))
APPEND2C_IN_AAAG(.(X1, X2), X3, X4, .(X1, X5)) → APPEND2C_IN_AAAG(X2, X3, X4, X5)
PERMA_IN_GA(.(X1, X2), .(X3, X4)) → U6_GA(X1, X2, X3, X4, append2cC_in_aaag(X5, X3, X6, X2))
U6_GA(X1, X2, X3, X4, append2cC_out_aaag(X5, X3, X6, X2)) → U7_GA(X1, X2, X3, X4, append1E_in_gga(X5, X6, X7))
U6_GA(X1, X2, X3, X4, append2cC_out_aaag(X5, X3, X6, X2)) → APPEND1E_IN_GGA(X5, X6, X7)
APPEND1E_IN_GGA(.(X1, X2), X3, .(X1, X4)) → U2_GGA(X1, X2, X3, X4, append1E_in_gga(X2, X3, X4))
APPEND1E_IN_GGA(.(X1, X2), X3, .(X1, X4)) → APPEND1E_IN_GGA(X2, X3, X4)
U6_GA(X1, X2, X3, X4, append2cC_out_aaag(X5, X3, X6, X2)) → U8_GA(X1, X2, X3, X4, append1cD_in_ggga(X1, X5, X6, X7))
U8_GA(X1, X2, X3, X4, append1cD_out_ggga(X1, X5, X6, X7)) → U9_GA(X1, X2, X3, X4, permA_in_ga(X7, X4))
U8_GA(X1, X2, X3, X4, append1cD_out_ggga(X1, X5, X6, X7)) → PERMA_IN_GA(X7, X4)

The TRS R consists of the following rules:

append1cB_in_ga(X1, X1) → append1cB_out_ga(X1, X1)
append2cC_in_aaag([], X1, X2, .(X1, X2)) → append2cC_out_aaag([], X1, X2, .(X1, X2))
append2cC_in_aaag(.(X1, X2), X3, X4, .(X1, X5)) → U16_aaag(X1, X2, X3, X4, X5, append2cC_in_aaag(X2, X3, X4, X5))
U16_aaag(X1, X2, X3, X4, X5, append2cC_out_aaag(X2, X3, X4, X5)) → append2cC_out_aaag(.(X1, X2), X3, X4, .(X1, X5))
append1cD_in_ggga(X1, X2, X3, .(X1, X4)) → U18_ggga(X1, X2, X3, X4, append1cE_in_gga(X2, X3, X4))
append1cE_in_gga([], X1, X1) → append1cE_out_gga([], X1, X1)
append1cE_in_gga(.(X1, X2), X3, .(X1, X4)) → U17_gga(X1, X2, X3, X4, append1cE_in_gga(X2, X3, X4))
U17_gga(X1, X2, X3, X4, append1cE_out_gga(X2, X3, X4)) → append1cE_out_gga(.(X1, X2), X3, .(X1, X4))
U18_ggga(X1, X2, X3, X4, append1cE_out_gga(X2, X3, X4)) → append1cD_out_ggga(X1, X2, X3, .(X1, X4))

The argument filtering Pi contains the following mapping:
permA_in_ga(x1, x2)  =  permA_in_ga(x1)
.(x1, x2)  =  .(x1, x2)
append1cB_in_ga(x1, x2)  =  append1cB_in_ga(x1)
append1cB_out_ga(x1, x2)  =  append1cB_out_ga(x1, x2)
append2C_in_aaag(x1, x2, x3, x4)  =  append2C_in_aaag(x4)
append2cC_in_aaag(x1, x2, x3, x4)  =  append2cC_in_aaag(x4)
append2cC_out_aaag(x1, x2, x3, x4)  =  append2cC_out_aaag(x1, x2, x3, x4)
U16_aaag(x1, x2, x3, x4, x5, x6)  =  U16_aaag(x1, x5, x6)
append1E_in_gga(x1, x2, x3)  =  append1E_in_gga(x1, x2)
append1cD_in_ggga(x1, x2, x3, x4)  =  append1cD_in_ggga(x1, x2, x3)
U18_ggga(x1, x2, x3, x4, x5)  =  U18_ggga(x1, x2, x3, x5)
append1cE_in_gga(x1, x2, x3)  =  append1cE_in_gga(x1, x2)
[]  =  []
append1cE_out_gga(x1, x2, x3)  =  append1cE_out_gga(x1, x2, x3)
U17_gga(x1, x2, x3, x4, x5)  =  U17_gga(x1, x2, x3, x5)
append1cD_out_ggga(x1, x2, x3, x4)  =  append1cD_out_ggga(x1, x2, x3, x4)
PERMA_IN_GA(x1, x2)  =  PERMA_IN_GA(x1)
U3_GA(x1, x2, x3, x4)  =  U3_GA(x1, x2, x4)
U4_GA(x1, x2, x3, x4)  =  U4_GA(x1, x2, x4)
U5_GA(x1, x2, x3, x4, x5)  =  U5_GA(x1, x2, x5)
APPEND2C_IN_AAAG(x1, x2, x3, x4)  =  APPEND2C_IN_AAAG(x4)
U1_AAAG(x1, x2, x3, x4, x5, x6)  =  U1_AAAG(x1, x5, x6)
U6_GA(x1, x2, x3, x4, x5)  =  U6_GA(x1, x2, x5)
U7_GA(x1, x2, x3, x4, x5)  =  U7_GA(x1, x2, x5)
APPEND1E_IN_GGA(x1, x2, x3)  =  APPEND1E_IN_GGA(x1, x2)
U2_GGA(x1, x2, x3, x4, x5)  =  U2_GGA(x1, x2, x3, x5)
U8_GA(x1, x2, x3, x4, x5)  =  U8_GA(x1, x2, x5)
U9_GA(x1, x2, x3, x4, x5)  =  U9_GA(x1, x2, x5)

We have to consider all (P,R,Pi)-chains

(5) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LOPSTR] contains 3 SCCs with 8 less nodes.

(6) Complex Obligation (AND)

(7) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

APPEND1E_IN_GGA(.(X1, X2), X3, .(X1, X4)) → APPEND1E_IN_GGA(X2, X3, X4)

The TRS R consists of the following rules:

append1cB_in_ga(X1, X1) → append1cB_out_ga(X1, X1)
append2cC_in_aaag([], X1, X2, .(X1, X2)) → append2cC_out_aaag([], X1, X2, .(X1, X2))
append2cC_in_aaag(.(X1, X2), X3, X4, .(X1, X5)) → U16_aaag(X1, X2, X3, X4, X5, append2cC_in_aaag(X2, X3, X4, X5))
U16_aaag(X1, X2, X3, X4, X5, append2cC_out_aaag(X2, X3, X4, X5)) → append2cC_out_aaag(.(X1, X2), X3, X4, .(X1, X5))
append1cD_in_ggga(X1, X2, X3, .(X1, X4)) → U18_ggga(X1, X2, X3, X4, append1cE_in_gga(X2, X3, X4))
append1cE_in_gga([], X1, X1) → append1cE_out_gga([], X1, X1)
append1cE_in_gga(.(X1, X2), X3, .(X1, X4)) → U17_gga(X1, X2, X3, X4, append1cE_in_gga(X2, X3, X4))
U17_gga(X1, X2, X3, X4, append1cE_out_gga(X2, X3, X4)) → append1cE_out_gga(.(X1, X2), X3, .(X1, X4))
U18_ggga(X1, X2, X3, X4, append1cE_out_gga(X2, X3, X4)) → append1cD_out_ggga(X1, X2, X3, .(X1, X4))

The argument filtering Pi contains the following mapping:
.(x1, x2)  =  .(x1, x2)
append1cB_in_ga(x1, x2)  =  append1cB_in_ga(x1)
append1cB_out_ga(x1, x2)  =  append1cB_out_ga(x1, x2)
append2cC_in_aaag(x1, x2, x3, x4)  =  append2cC_in_aaag(x4)
append2cC_out_aaag(x1, x2, x3, x4)  =  append2cC_out_aaag(x1, x2, x3, x4)
U16_aaag(x1, x2, x3, x4, x5, x6)  =  U16_aaag(x1, x5, x6)
append1cD_in_ggga(x1, x2, x3, x4)  =  append1cD_in_ggga(x1, x2, x3)
U18_ggga(x1, x2, x3, x4, x5)  =  U18_ggga(x1, x2, x3, x5)
append1cE_in_gga(x1, x2, x3)  =  append1cE_in_gga(x1, x2)
[]  =  []
append1cE_out_gga(x1, x2, x3)  =  append1cE_out_gga(x1, x2, x3)
U17_gga(x1, x2, x3, x4, x5)  =  U17_gga(x1, x2, x3, x5)
append1cD_out_ggga(x1, x2, x3, x4)  =  append1cD_out_ggga(x1, x2, x3, x4)
APPEND1E_IN_GGA(x1, x2, x3)  =  APPEND1E_IN_GGA(x1, x2)

We have to consider all (P,R,Pi)-chains

(8) UsableRulesProof (EQUIVALENT transformation)

For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R.

(9) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

APPEND1E_IN_GGA(.(X1, X2), X3, .(X1, X4)) → APPEND1E_IN_GGA(X2, X3, X4)

R is empty.
The argument filtering Pi contains the following mapping:
.(x1, x2)  =  .(x1, x2)
APPEND1E_IN_GGA(x1, x2, x3)  =  APPEND1E_IN_GGA(x1, x2)

We have to consider all (P,R,Pi)-chains

(10) PiDPToQDPProof (SOUND transformation)

Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.

(11) Obligation:

Q DP problem:
The TRS P consists of the following rules:

APPEND1E_IN_GGA(.(X1, X2), X3) → APPEND1E_IN_GGA(X2, X3)

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.

(12) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

  • APPEND1E_IN_GGA(.(X1, X2), X3) → APPEND1E_IN_GGA(X2, X3)
    The graph contains the following edges 1 > 1, 2 >= 2

(13) YES

(14) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

APPEND2C_IN_AAAG(.(X1, X2), X3, X4, .(X1, X5)) → APPEND2C_IN_AAAG(X2, X3, X4, X5)

The TRS R consists of the following rules:

append1cB_in_ga(X1, X1) → append1cB_out_ga(X1, X1)
append2cC_in_aaag([], X1, X2, .(X1, X2)) → append2cC_out_aaag([], X1, X2, .(X1, X2))
append2cC_in_aaag(.(X1, X2), X3, X4, .(X1, X5)) → U16_aaag(X1, X2, X3, X4, X5, append2cC_in_aaag(X2, X3, X4, X5))
U16_aaag(X1, X2, X3, X4, X5, append2cC_out_aaag(X2, X3, X4, X5)) → append2cC_out_aaag(.(X1, X2), X3, X4, .(X1, X5))
append1cD_in_ggga(X1, X2, X3, .(X1, X4)) → U18_ggga(X1, X2, X3, X4, append1cE_in_gga(X2, X3, X4))
append1cE_in_gga([], X1, X1) → append1cE_out_gga([], X1, X1)
append1cE_in_gga(.(X1, X2), X3, .(X1, X4)) → U17_gga(X1, X2, X3, X4, append1cE_in_gga(X2, X3, X4))
U17_gga(X1, X2, X3, X4, append1cE_out_gga(X2, X3, X4)) → append1cE_out_gga(.(X1, X2), X3, .(X1, X4))
U18_ggga(X1, X2, X3, X4, append1cE_out_gga(X2, X3, X4)) → append1cD_out_ggga(X1, X2, X3, .(X1, X4))

The argument filtering Pi contains the following mapping:
.(x1, x2)  =  .(x1, x2)
append1cB_in_ga(x1, x2)  =  append1cB_in_ga(x1)
append1cB_out_ga(x1, x2)  =  append1cB_out_ga(x1, x2)
append2cC_in_aaag(x1, x2, x3, x4)  =  append2cC_in_aaag(x4)
append2cC_out_aaag(x1, x2, x3, x4)  =  append2cC_out_aaag(x1, x2, x3, x4)
U16_aaag(x1, x2, x3, x4, x5, x6)  =  U16_aaag(x1, x5, x6)
append1cD_in_ggga(x1, x2, x3, x4)  =  append1cD_in_ggga(x1, x2, x3)
U18_ggga(x1, x2, x3, x4, x5)  =  U18_ggga(x1, x2, x3, x5)
append1cE_in_gga(x1, x2, x3)  =  append1cE_in_gga(x1, x2)
[]  =  []
append1cE_out_gga(x1, x2, x3)  =  append1cE_out_gga(x1, x2, x3)
U17_gga(x1, x2, x3, x4, x5)  =  U17_gga(x1, x2, x3, x5)
append1cD_out_ggga(x1, x2, x3, x4)  =  append1cD_out_ggga(x1, x2, x3, x4)
APPEND2C_IN_AAAG(x1, x2, x3, x4)  =  APPEND2C_IN_AAAG(x4)

We have to consider all (P,R,Pi)-chains

(15) UsableRulesProof (EQUIVALENT transformation)

For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R.

(16) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

APPEND2C_IN_AAAG(.(X1, X2), X3, X4, .(X1, X5)) → APPEND2C_IN_AAAG(X2, X3, X4, X5)

R is empty.
The argument filtering Pi contains the following mapping:
.(x1, x2)  =  .(x1, x2)
APPEND2C_IN_AAAG(x1, x2, x3, x4)  =  APPEND2C_IN_AAAG(x4)

We have to consider all (P,R,Pi)-chains

(17) PiDPToQDPProof (SOUND transformation)

Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.

(18) Obligation:

Q DP problem:
The TRS P consists of the following rules:

APPEND2C_IN_AAAG(.(X1, X5)) → APPEND2C_IN_AAAG(X5)

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.

(19) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

  • APPEND2C_IN_AAAG(.(X1, X5)) → APPEND2C_IN_AAAG(X5)
    The graph contains the following edges 1 > 1

(20) YES

(21) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

U3_GA(X1, X2, X3, append1cB_out_ga(X2, X4)) → PERMA_IN_GA(X4, X3)
PERMA_IN_GA(.(X1, X2), .(X1, X3)) → U3_GA(X1, X2, X3, append1cB_in_ga(X2, X4))
PERMA_IN_GA(.(X1, X2), .(X3, X4)) → U6_GA(X1, X2, X3, X4, append2cC_in_aaag(X5, X3, X6, X2))
U6_GA(X1, X2, X3, X4, append2cC_out_aaag(X5, X3, X6, X2)) → U8_GA(X1, X2, X3, X4, append1cD_in_ggga(X1, X5, X6, X7))
U8_GA(X1, X2, X3, X4, append1cD_out_ggga(X1, X5, X6, X7)) → PERMA_IN_GA(X7, X4)

The TRS R consists of the following rules:

append1cB_in_ga(X1, X1) → append1cB_out_ga(X1, X1)
append2cC_in_aaag([], X1, X2, .(X1, X2)) → append2cC_out_aaag([], X1, X2, .(X1, X2))
append2cC_in_aaag(.(X1, X2), X3, X4, .(X1, X5)) → U16_aaag(X1, X2, X3, X4, X5, append2cC_in_aaag(X2, X3, X4, X5))
U16_aaag(X1, X2, X3, X4, X5, append2cC_out_aaag(X2, X3, X4, X5)) → append2cC_out_aaag(.(X1, X2), X3, X4, .(X1, X5))
append1cD_in_ggga(X1, X2, X3, .(X1, X4)) → U18_ggga(X1, X2, X3, X4, append1cE_in_gga(X2, X3, X4))
append1cE_in_gga([], X1, X1) → append1cE_out_gga([], X1, X1)
append1cE_in_gga(.(X1, X2), X3, .(X1, X4)) → U17_gga(X1, X2, X3, X4, append1cE_in_gga(X2, X3, X4))
U17_gga(X1, X2, X3, X4, append1cE_out_gga(X2, X3, X4)) → append1cE_out_gga(.(X1, X2), X3, .(X1, X4))
U18_ggga(X1, X2, X3, X4, append1cE_out_gga(X2, X3, X4)) → append1cD_out_ggga(X1, X2, X3, .(X1, X4))

The argument filtering Pi contains the following mapping:
.(x1, x2)  =  .(x1, x2)
append1cB_in_ga(x1, x2)  =  append1cB_in_ga(x1)
append1cB_out_ga(x1, x2)  =  append1cB_out_ga(x1, x2)
append2cC_in_aaag(x1, x2, x3, x4)  =  append2cC_in_aaag(x4)
append2cC_out_aaag(x1, x2, x3, x4)  =  append2cC_out_aaag(x1, x2, x3, x4)
U16_aaag(x1, x2, x3, x4, x5, x6)  =  U16_aaag(x1, x5, x6)
append1cD_in_ggga(x1, x2, x3, x4)  =  append1cD_in_ggga(x1, x2, x3)
U18_ggga(x1, x2, x3, x4, x5)  =  U18_ggga(x1, x2, x3, x5)
append1cE_in_gga(x1, x2, x3)  =  append1cE_in_gga(x1, x2)
[]  =  []
append1cE_out_gga(x1, x2, x3)  =  append1cE_out_gga(x1, x2, x3)
U17_gga(x1, x2, x3, x4, x5)  =  U17_gga(x1, x2, x3, x5)
append1cD_out_ggga(x1, x2, x3, x4)  =  append1cD_out_ggga(x1, x2, x3, x4)
PERMA_IN_GA(x1, x2)  =  PERMA_IN_GA(x1)
U3_GA(x1, x2, x3, x4)  =  U3_GA(x1, x2, x4)
U6_GA(x1, x2, x3, x4, x5)  =  U6_GA(x1, x2, x5)
U8_GA(x1, x2, x3, x4, x5)  =  U8_GA(x1, x2, x5)

We have to consider all (P,R,Pi)-chains

(22) PiDPToQDPProof (SOUND transformation)

Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.

(23) Obligation:

Q DP problem:
The TRS P consists of the following rules:

U3_GA(X1, X2, append1cB_out_ga(X2, X4)) → PERMA_IN_GA(X4)
PERMA_IN_GA(.(X1, X2)) → U3_GA(X1, X2, append1cB_in_ga(X2))
PERMA_IN_GA(.(X1, X2)) → U6_GA(X1, X2, append2cC_in_aaag(X2))
U6_GA(X1, X2, append2cC_out_aaag(X5, X3, X6, X2)) → U8_GA(X1, X2, append1cD_in_ggga(X1, X5, X6))
U8_GA(X1, X2, append1cD_out_ggga(X1, X5, X6, X7)) → PERMA_IN_GA(X7)

The TRS R consists of the following rules:

append1cB_in_ga(X1) → append1cB_out_ga(X1, X1)
append2cC_in_aaag(.(X1, X2)) → append2cC_out_aaag([], X1, X2, .(X1, X2))
append2cC_in_aaag(.(X1, X5)) → U16_aaag(X1, X5, append2cC_in_aaag(X5))
U16_aaag(X1, X5, append2cC_out_aaag(X2, X3, X4, X5)) → append2cC_out_aaag(.(X1, X2), X3, X4, .(X1, X5))
append1cD_in_ggga(X1, X2, X3) → U18_ggga(X1, X2, X3, append1cE_in_gga(X2, X3))
append1cE_in_gga([], X1) → append1cE_out_gga([], X1, X1)
append1cE_in_gga(.(X1, X2), X3) → U17_gga(X1, X2, X3, append1cE_in_gga(X2, X3))
U17_gga(X1, X2, X3, append1cE_out_gga(X2, X3, X4)) → append1cE_out_gga(.(X1, X2), X3, .(X1, X4))
U18_ggga(X1, X2, X3, append1cE_out_gga(X2, X3, X4)) → append1cD_out_ggga(X1, X2, X3, .(X1, X4))

The set Q consists of the following terms:

append1cB_in_ga(x0)
append2cC_in_aaag(x0)
U16_aaag(x0, x1, x2)
append1cD_in_ggga(x0, x1, x2)
append1cE_in_gga(x0, x1)
U17_gga(x0, x1, x2, x3)
U18_ggga(x0, x1, x2, x3)

We have to consider all (P,Q,R)-chains.

(24) Rewriting (EQUIVALENT transformation)

By rewriting [LPAR04] the rule PERMA_IN_GA(.(X1, X2)) → U3_GA(X1, X2, append1cB_in_ga(X2)) at position [2] we obtained the following new rules [LPAR04]:

PERMA_IN_GA(.(X1, X2)) → U3_GA(X1, X2, append1cB_out_ga(X2, X2))

(25) Obligation:

Q DP problem:
The TRS P consists of the following rules:

U3_GA(X1, X2, append1cB_out_ga(X2, X4)) → PERMA_IN_GA(X4)
PERMA_IN_GA(.(X1, X2)) → U6_GA(X1, X2, append2cC_in_aaag(X2))
U6_GA(X1, X2, append2cC_out_aaag(X5, X3, X6, X2)) → U8_GA(X1, X2, append1cD_in_ggga(X1, X5, X6))
U8_GA(X1, X2, append1cD_out_ggga(X1, X5, X6, X7)) → PERMA_IN_GA(X7)
PERMA_IN_GA(.(X1, X2)) → U3_GA(X1, X2, append1cB_out_ga(X2, X2))

The TRS R consists of the following rules:

append1cB_in_ga(X1) → append1cB_out_ga(X1, X1)
append2cC_in_aaag(.(X1, X2)) → append2cC_out_aaag([], X1, X2, .(X1, X2))
append2cC_in_aaag(.(X1, X5)) → U16_aaag(X1, X5, append2cC_in_aaag(X5))
U16_aaag(X1, X5, append2cC_out_aaag(X2, X3, X4, X5)) → append2cC_out_aaag(.(X1, X2), X3, X4, .(X1, X5))
append1cD_in_ggga(X1, X2, X3) → U18_ggga(X1, X2, X3, append1cE_in_gga(X2, X3))
append1cE_in_gga([], X1) → append1cE_out_gga([], X1, X1)
append1cE_in_gga(.(X1, X2), X3) → U17_gga(X1, X2, X3, append1cE_in_gga(X2, X3))
U17_gga(X1, X2, X3, append1cE_out_gga(X2, X3, X4)) → append1cE_out_gga(.(X1, X2), X3, .(X1, X4))
U18_ggga(X1, X2, X3, append1cE_out_gga(X2, X3, X4)) → append1cD_out_ggga(X1, X2, X3, .(X1, X4))

The set Q consists of the following terms:

append1cB_in_ga(x0)
append2cC_in_aaag(x0)
U16_aaag(x0, x1, x2)
append1cD_in_ggga(x0, x1, x2)
append1cE_in_gga(x0, x1)
U17_gga(x0, x1, x2, x3)
U18_ggga(x0, x1, x2, x3)

We have to consider all (P,Q,R)-chains.

(26) UsableRulesProof (EQUIVALENT transformation)

As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.

(27) Obligation:

Q DP problem:
The TRS P consists of the following rules:

U3_GA(X1, X2, append1cB_out_ga(X2, X4)) → PERMA_IN_GA(X4)
PERMA_IN_GA(.(X1, X2)) → U6_GA(X1, X2, append2cC_in_aaag(X2))
U6_GA(X1, X2, append2cC_out_aaag(X5, X3, X6, X2)) → U8_GA(X1, X2, append1cD_in_ggga(X1, X5, X6))
U8_GA(X1, X2, append1cD_out_ggga(X1, X5, X6, X7)) → PERMA_IN_GA(X7)
PERMA_IN_GA(.(X1, X2)) → U3_GA(X1, X2, append1cB_out_ga(X2, X2))

The TRS R consists of the following rules:

append1cD_in_ggga(X1, X2, X3) → U18_ggga(X1, X2, X3, append1cE_in_gga(X2, X3))
append1cE_in_gga([], X1) → append1cE_out_gga([], X1, X1)
append1cE_in_gga(.(X1, X2), X3) → U17_gga(X1, X2, X3, append1cE_in_gga(X2, X3))
U18_ggga(X1, X2, X3, append1cE_out_gga(X2, X3, X4)) → append1cD_out_ggga(X1, X2, X3, .(X1, X4))
U17_gga(X1, X2, X3, append1cE_out_gga(X2, X3, X4)) → append1cE_out_gga(.(X1, X2), X3, .(X1, X4))
append2cC_in_aaag(.(X1, X2)) → append2cC_out_aaag([], X1, X2, .(X1, X2))
append2cC_in_aaag(.(X1, X5)) → U16_aaag(X1, X5, append2cC_in_aaag(X5))
U16_aaag(X1, X5, append2cC_out_aaag(X2, X3, X4, X5)) → append2cC_out_aaag(.(X1, X2), X3, X4, .(X1, X5))

The set Q consists of the following terms:

append1cB_in_ga(x0)
append2cC_in_aaag(x0)
U16_aaag(x0, x1, x2)
append1cD_in_ggga(x0, x1, x2)
append1cE_in_gga(x0, x1)
U17_gga(x0, x1, x2, x3)
U18_ggga(x0, x1, x2, x3)

We have to consider all (P,Q,R)-chains.

(28) QReductionProof (EQUIVALENT transformation)

We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.[THIEMANN].

append1cB_in_ga(x0)

(29) Obligation:

Q DP problem:
The TRS P consists of the following rules:

U3_GA(X1, X2, append1cB_out_ga(X2, X4)) → PERMA_IN_GA(X4)
PERMA_IN_GA(.(X1, X2)) → U6_GA(X1, X2, append2cC_in_aaag(X2))
U6_GA(X1, X2, append2cC_out_aaag(X5, X3, X6, X2)) → U8_GA(X1, X2, append1cD_in_ggga(X1, X5, X6))
U8_GA(X1, X2, append1cD_out_ggga(X1, X5, X6, X7)) → PERMA_IN_GA(X7)
PERMA_IN_GA(.(X1, X2)) → U3_GA(X1, X2, append1cB_out_ga(X2, X2))

The TRS R consists of the following rules:

append1cD_in_ggga(X1, X2, X3) → U18_ggga(X1, X2, X3, append1cE_in_gga(X2, X3))
append1cE_in_gga([], X1) → append1cE_out_gga([], X1, X1)
append1cE_in_gga(.(X1, X2), X3) → U17_gga(X1, X2, X3, append1cE_in_gga(X2, X3))
U18_ggga(X1, X2, X3, append1cE_out_gga(X2, X3, X4)) → append1cD_out_ggga(X1, X2, X3, .(X1, X4))
U17_gga(X1, X2, X3, append1cE_out_gga(X2, X3, X4)) → append1cE_out_gga(.(X1, X2), X3, .(X1, X4))
append2cC_in_aaag(.(X1, X2)) → append2cC_out_aaag([], X1, X2, .(X1, X2))
append2cC_in_aaag(.(X1, X5)) → U16_aaag(X1, X5, append2cC_in_aaag(X5))
U16_aaag(X1, X5, append2cC_out_aaag(X2, X3, X4, X5)) → append2cC_out_aaag(.(X1, X2), X3, X4, .(X1, X5))

The set Q consists of the following terms:

append2cC_in_aaag(x0)
U16_aaag(x0, x1, x2)
append1cD_in_ggga(x0, x1, x2)
append1cE_in_gga(x0, x1)
U17_gga(x0, x1, x2, x3)
U18_ggga(x0, x1, x2, x3)

We have to consider all (P,Q,R)-chains.

(30) Rewriting (EQUIVALENT transformation)

By rewriting [LPAR04] the rule U6_GA(X1, X2, append2cC_out_aaag(X5, X3, X6, X2)) → U8_GA(X1, X2, append1cD_in_ggga(X1, X5, X6)) at position [2] we obtained the following new rules [LPAR04]:

U6_GA(X1, X2, append2cC_out_aaag(X5, X3, X6, X2)) → U8_GA(X1, X2, U18_ggga(X1, X5, X6, append1cE_in_gga(X5, X6)))

(31) Obligation:

Q DP problem:
The TRS P consists of the following rules:

U3_GA(X1, X2, append1cB_out_ga(X2, X4)) → PERMA_IN_GA(X4)
PERMA_IN_GA(.(X1, X2)) → U6_GA(X1, X2, append2cC_in_aaag(X2))
U8_GA(X1, X2, append1cD_out_ggga(X1, X5, X6, X7)) → PERMA_IN_GA(X7)
PERMA_IN_GA(.(X1, X2)) → U3_GA(X1, X2, append1cB_out_ga(X2, X2))
U6_GA(X1, X2, append2cC_out_aaag(X5, X3, X6, X2)) → U8_GA(X1, X2, U18_ggga(X1, X5, X6, append1cE_in_gga(X5, X6)))

The TRS R consists of the following rules:

append1cD_in_ggga(X1, X2, X3) → U18_ggga(X1, X2, X3, append1cE_in_gga(X2, X3))
append1cE_in_gga([], X1) → append1cE_out_gga([], X1, X1)
append1cE_in_gga(.(X1, X2), X3) → U17_gga(X1, X2, X3, append1cE_in_gga(X2, X3))
U18_ggga(X1, X2, X3, append1cE_out_gga(X2, X3, X4)) → append1cD_out_ggga(X1, X2, X3, .(X1, X4))
U17_gga(X1, X2, X3, append1cE_out_gga(X2, X3, X4)) → append1cE_out_gga(.(X1, X2), X3, .(X1, X4))
append2cC_in_aaag(.(X1, X2)) → append2cC_out_aaag([], X1, X2, .(X1, X2))
append2cC_in_aaag(.(X1, X5)) → U16_aaag(X1, X5, append2cC_in_aaag(X5))
U16_aaag(X1, X5, append2cC_out_aaag(X2, X3, X4, X5)) → append2cC_out_aaag(.(X1, X2), X3, X4, .(X1, X5))

The set Q consists of the following terms:

append2cC_in_aaag(x0)
U16_aaag(x0, x1, x2)
append1cD_in_ggga(x0, x1, x2)
append1cE_in_gga(x0, x1)
U17_gga(x0, x1, x2, x3)
U18_ggga(x0, x1, x2, x3)

We have to consider all (P,Q,R)-chains.

(32) UsableRulesProof (EQUIVALENT transformation)

As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.

(33) Obligation:

Q DP problem:
The TRS P consists of the following rules:

U3_GA(X1, X2, append1cB_out_ga(X2, X4)) → PERMA_IN_GA(X4)
PERMA_IN_GA(.(X1, X2)) → U6_GA(X1, X2, append2cC_in_aaag(X2))
U8_GA(X1, X2, append1cD_out_ggga(X1, X5, X6, X7)) → PERMA_IN_GA(X7)
PERMA_IN_GA(.(X1, X2)) → U3_GA(X1, X2, append1cB_out_ga(X2, X2))
U6_GA(X1, X2, append2cC_out_aaag(X5, X3, X6, X2)) → U8_GA(X1, X2, U18_ggga(X1, X5, X6, append1cE_in_gga(X5, X6)))

The TRS R consists of the following rules:

append1cE_in_gga([], X1) → append1cE_out_gga([], X1, X1)
append1cE_in_gga(.(X1, X2), X3) → U17_gga(X1, X2, X3, append1cE_in_gga(X2, X3))
U18_ggga(X1, X2, X3, append1cE_out_gga(X2, X3, X4)) → append1cD_out_ggga(X1, X2, X3, .(X1, X4))
U17_gga(X1, X2, X3, append1cE_out_gga(X2, X3, X4)) → append1cE_out_gga(.(X1, X2), X3, .(X1, X4))
append2cC_in_aaag(.(X1, X2)) → append2cC_out_aaag([], X1, X2, .(X1, X2))
append2cC_in_aaag(.(X1, X5)) → U16_aaag(X1, X5, append2cC_in_aaag(X5))
U16_aaag(X1, X5, append2cC_out_aaag(X2, X3, X4, X5)) → append2cC_out_aaag(.(X1, X2), X3, X4, .(X1, X5))

The set Q consists of the following terms:

append2cC_in_aaag(x0)
U16_aaag(x0, x1, x2)
append1cD_in_ggga(x0, x1, x2)
append1cE_in_gga(x0, x1)
U17_gga(x0, x1, x2, x3)
U18_ggga(x0, x1, x2, x3)

We have to consider all (P,Q,R)-chains.

(34) QReductionProof (EQUIVALENT transformation)

We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.[THIEMANN].

append1cD_in_ggga(x0, x1, x2)

(35) Obligation:

Q DP problem:
The TRS P consists of the following rules:

U3_GA(X1, X2, append1cB_out_ga(X2, X4)) → PERMA_IN_GA(X4)
PERMA_IN_GA(.(X1, X2)) → U6_GA(X1, X2, append2cC_in_aaag(X2))
U8_GA(X1, X2, append1cD_out_ggga(X1, X5, X6, X7)) → PERMA_IN_GA(X7)
PERMA_IN_GA(.(X1, X2)) → U3_GA(X1, X2, append1cB_out_ga(X2, X2))
U6_GA(X1, X2, append2cC_out_aaag(X5, X3, X6, X2)) → U8_GA(X1, X2, U18_ggga(X1, X5, X6, append1cE_in_gga(X5, X6)))

The TRS R consists of the following rules:

append1cE_in_gga([], X1) → append1cE_out_gga([], X1, X1)
append1cE_in_gga(.(X1, X2), X3) → U17_gga(X1, X2, X3, append1cE_in_gga(X2, X3))
U18_ggga(X1, X2, X3, append1cE_out_gga(X2, X3, X4)) → append1cD_out_ggga(X1, X2, X3, .(X1, X4))
U17_gga(X1, X2, X3, append1cE_out_gga(X2, X3, X4)) → append1cE_out_gga(.(X1, X2), X3, .(X1, X4))
append2cC_in_aaag(.(X1, X2)) → append2cC_out_aaag([], X1, X2, .(X1, X2))
append2cC_in_aaag(.(X1, X5)) → U16_aaag(X1, X5, append2cC_in_aaag(X5))
U16_aaag(X1, X5, append2cC_out_aaag(X2, X3, X4, X5)) → append2cC_out_aaag(.(X1, X2), X3, X4, .(X1, X5))

The set Q consists of the following terms:

append2cC_in_aaag(x0)
U16_aaag(x0, x1, x2)
append1cE_in_gga(x0, x1)
U17_gga(x0, x1, x2, x3)
U18_ggga(x0, x1, x2, x3)

We have to consider all (P,Q,R)-chains.

(36) Instantiation (EQUIVALENT transformation)

By instantiating [LPAR04] the rule U3_GA(X1, X2, append1cB_out_ga(X2, X4)) → PERMA_IN_GA(X4) we obtained the following new rules [LPAR04]:

U3_GA(z0, z1, append1cB_out_ga(z1, z1)) → PERMA_IN_GA(z1)

(37) Obligation:

Q DP problem:
The TRS P consists of the following rules:

PERMA_IN_GA(.(X1, X2)) → U6_GA(X1, X2, append2cC_in_aaag(X2))
U8_GA(X1, X2, append1cD_out_ggga(X1, X5, X6, X7)) → PERMA_IN_GA(X7)
PERMA_IN_GA(.(X1, X2)) → U3_GA(X1, X2, append1cB_out_ga(X2, X2))
U6_GA(X1, X2, append2cC_out_aaag(X5, X3, X6, X2)) → U8_GA(X1, X2, U18_ggga(X1, X5, X6, append1cE_in_gga(X5, X6)))
U3_GA(z0, z1, append1cB_out_ga(z1, z1)) → PERMA_IN_GA(z1)

The TRS R consists of the following rules:

append1cE_in_gga([], X1) → append1cE_out_gga([], X1, X1)
append1cE_in_gga(.(X1, X2), X3) → U17_gga(X1, X2, X3, append1cE_in_gga(X2, X3))
U18_ggga(X1, X2, X3, append1cE_out_gga(X2, X3, X4)) → append1cD_out_ggga(X1, X2, X3, .(X1, X4))
U17_gga(X1, X2, X3, append1cE_out_gga(X2, X3, X4)) → append1cE_out_gga(.(X1, X2), X3, .(X1, X4))
append2cC_in_aaag(.(X1, X2)) → append2cC_out_aaag([], X1, X2, .(X1, X2))
append2cC_in_aaag(.(X1, X5)) → U16_aaag(X1, X5, append2cC_in_aaag(X5))
U16_aaag(X1, X5, append2cC_out_aaag(X2, X3, X4, X5)) → append2cC_out_aaag(.(X1, X2), X3, X4, .(X1, X5))

The set Q consists of the following terms:

append2cC_in_aaag(x0)
U16_aaag(x0, x1, x2)
append1cE_in_gga(x0, x1)
U17_gga(x0, x1, x2, x3)
U18_ggga(x0, x1, x2, x3)

We have to consider all (P,Q,R)-chains.

(38) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04,JAR06].


The following pairs can be oriented strictly and are deleted.


U6_GA(X1, X2, append2cC_out_aaag(X5, X3, X6, X2)) → U8_GA(X1, X2, U18_ggga(X1, X5, X6, append1cE_in_gga(X5, X6)))
U3_GA(z0, z1, append1cB_out_ga(z1, z1)) → PERMA_IN_GA(z1)
The remaining pairs can at least be oriented weakly.
Used ordering: Polynomial interpretation [POLO]:

POL(.(x1, x2)) = 1 + x2   
POL(PERMA_IN_GA(x1)) = x1   
POL(U16_aaag(x1, x2, x3)) = 1 + x3   
POL(U17_gga(x1, x2, x3, x4)) = 1 + x4   
POL(U18_ggga(x1, x2, x3, x4)) = x4   
POL(U3_GA(x1, x2, x3)) = x2 + x3   
POL(U6_GA(x1, x2, x3)) = 1 + x3   
POL(U8_GA(x1, x2, x3)) = x3   
POL([]) = 0   
POL(append1cB_out_ga(x1, x2)) = 1   
POL(append1cD_out_ggga(x1, x2, x3, x4)) = x4   
POL(append1cE_in_gga(x1, x2)) = 1 + x1 + x2   
POL(append1cE_out_gga(x1, x2, x3)) = 1 + x3   
POL(append2cC_in_aaag(x1)) = x1   
POL(append2cC_out_aaag(x1, x2, x3, x4)) = 1 + x1 + x3   

The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

append2cC_in_aaag(.(X1, X2)) → append2cC_out_aaag([], X1, X2, .(X1, X2))
append2cC_in_aaag(.(X1, X5)) → U16_aaag(X1, X5, append2cC_in_aaag(X5))
append1cE_in_gga([], X1) → append1cE_out_gga([], X1, X1)
append1cE_in_gga(.(X1, X2), X3) → U17_gga(X1, X2, X3, append1cE_in_gga(X2, X3))
U18_ggga(X1, X2, X3, append1cE_out_gga(X2, X3, X4)) → append1cD_out_ggga(X1, X2, X3, .(X1, X4))
U17_gga(X1, X2, X3, append1cE_out_gga(X2, X3, X4)) → append1cE_out_gga(.(X1, X2), X3, .(X1, X4))
U16_aaag(X1, X5, append2cC_out_aaag(X2, X3, X4, X5)) → append2cC_out_aaag(.(X1, X2), X3, X4, .(X1, X5))

(39) Obligation:

Q DP problem:
The TRS P consists of the following rules:

PERMA_IN_GA(.(X1, X2)) → U6_GA(X1, X2, append2cC_in_aaag(X2))
U8_GA(X1, X2, append1cD_out_ggga(X1, X5, X6, X7)) → PERMA_IN_GA(X7)
PERMA_IN_GA(.(X1, X2)) → U3_GA(X1, X2, append1cB_out_ga(X2, X2))

The TRS R consists of the following rules:

append1cE_in_gga([], X1) → append1cE_out_gga([], X1, X1)
append1cE_in_gga(.(X1, X2), X3) → U17_gga(X1, X2, X3, append1cE_in_gga(X2, X3))
U18_ggga(X1, X2, X3, append1cE_out_gga(X2, X3, X4)) → append1cD_out_ggga(X1, X2, X3, .(X1, X4))
U17_gga(X1, X2, X3, append1cE_out_gga(X2, X3, X4)) → append1cE_out_gga(.(X1, X2), X3, .(X1, X4))
append2cC_in_aaag(.(X1, X2)) → append2cC_out_aaag([], X1, X2, .(X1, X2))
append2cC_in_aaag(.(X1, X5)) → U16_aaag(X1, X5, append2cC_in_aaag(X5))
U16_aaag(X1, X5, append2cC_out_aaag(X2, X3, X4, X5)) → append2cC_out_aaag(.(X1, X2), X3, X4, .(X1, X5))

The set Q consists of the following terms:

append2cC_in_aaag(x0)
U16_aaag(x0, x1, x2)
append1cE_in_gga(x0, x1)
U17_gga(x0, x1, x2, x3)
U18_ggga(x0, x1, x2, x3)

We have to consider all (P,Q,R)-chains.

(40) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 3 less nodes.

(41) TRUE